Realistic analysis of some randomized algorithms
نویسندگان
چکیده
منابع مشابه
Some New Randomized Approximation Algorithms
The topic of this thesis is approximation algorithms for optimization versions of NP-complete decision problems. No exact algorithms with sub-exponential running times are known for these problems, and therefore approximation algorithms with polynomial running times are studied. An approximation algorithm does not necessarily nd the optimal solution, but it leaves a guarantee of how far from th...
متن کاملA general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
We describe a general framework for realistic analysis of sorting and searching algorithms, and we apply it to the average-case analysis of five basic algorithms: three sorting algorithms (QuickSort, InsertionSort, BubbleSort) and two selection algorithms (QuickMin and SelectionMin). Usually, the analysis deals with the mean number of key comparisons, but, here, we view keys as words produced b...
متن کاملA Probabilistic Analysis of Some Tree Algorithms
Abstract. In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to complex analysis techniques as it is usually the case. This approach gives a unified probabilistic treatment of these questions. ...
متن کاملA Probabilistic Analysis of Some Tree Algorithms
INRIA In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and ex...
متن کاملBackwards Analysis of Randomized Geometric Algorithms
The theme of this paper is a rather simple method that has proved very potent in the analysis of the expected performance of various randomized algorithms and data structures in computational geometry. The method can be described as \analyze a ran-domized algorithm as if it were running backwards in time, from output to input." We apply this type of analysis to a variety of algorithms, old and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1991
ISSN: 0022-0000
DOI: 10.1016/0022-0000(91)90038-7